CHAUDHURI , ET AL : A SOLUTION METHODOLOGY FOR EXACT DESIGN SPACE EXPLORATION IN A 3 D DESIGN SPACE 3 Time - Constrained 3 D

نویسندگان

  • Samit Chaudhuri
  • Stephen A. Blythe
  • Robert A. Walker
چکیده

1 A Solution Methodology for Exact Design Space Exploration in a Three-Dimensional Design Space1 Samit Chaudhuri 2 Stephen A. Blythe3 Robert A. Walker 4 Cadence Design Systems Rensselaer Polytechnic Institute Kent State University San Jose, CA 95134 Troy, NY 12180 Kent, OH 44242 Abstract| This paper describes an exact solution methodology, implemented in Rensselaer's Voyager design space exploration system, for solving the scheduling problem in a 3dimensional (3D) design space: the usual 2D design space (which trades o area and schedule length), plus a third dimension representing clock length. Unlike design space exploration methodologies which rely on bounds or estimates, this methodology is guaranteed to nd the globally optimal solution to a 3D scheduling problem. Furthermore, this methodology e ciently prunes the search space, eliminating provably inferior design points through: (1) a careful selection of candidate clock lengths, and (2) tight bounds on the number of functional units or on the schedule length. Both chaining and multi-cycle operations are supported.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A solution methodology for exact design space exploration in a three-dimensional design space

| This paper describes an exact solution methodology, implemented in Rensselaer's Voyager design space exploration system, for solving the scheduling problem in a 3dimensional (3D) design space: the usual 2D design space (which trades o area and schedule length), plus a third dimension representing clock length. Unlike design space exploration methodologies which rely on bounds or estimates, th...

متن کامل

Eecient Optimal Design Space Characterization Methodologies

One of the primary advantages of a high-level synthesis system is its ability to explore the design space. This paper presents several methodologies for design space exploration that compute all optimal tradeoo points for the combined problem of scheduling, clock length determination, and module selection. We discuss how each methodology takes advantage of both the structure within the design s...

متن کامل

New best proximity point results in G-metric space

Best approximation results provide an approximate solution to the fixed point equation $Tx=x$, when the non-self mapping $T$ has no fixed point. In particular, a well-known best approximation theorem, due to Fan cite{5}, asserts that if $K$ is a nonempty compact convex subset of a Hausdorff locally convex topological vector space $E$ and $T:Krightarrow E$ is a continuous mapping, then there exi...

متن کامل

The Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach

In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...

متن کامل

Chaudhuri and Walker : Computing Lower Bounds On

1 Computing Lower Bounds on Functional Units Before Scheduling1 Samit Chaudhuri2, Robert A. Walker3 Abstract|This paper presents a new polynomial-time algorithm for computing lower bounds on the number of functional units (FUs) of each type required to schedule a data ow graph in a speci ed number of control steps. A formal approach is presented that is guaranteed to nd the tightest possible bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997